Best simultaneous approximation to totally bounded sequences in Banach spaces

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Best Simultaneous Approximation to Totally Bounded Sequences in Banach Spaces

This paper is concerned with the problem of best weighted simultaneous approximations to totally bounded sequences in Banach spaces. Characterization results from convex sets in Banach spaces are established under the assumption that the Banach space is uniformly smooth.

متن کامل

BEST SIMULTANEOUS APPROXIMATION IN FUZZY NORMED SPACES

The main purpose of this paper is to consider the t-best simultaneousapproximation in fuzzy normed spaces. We develop the theory of t-bestsimultaneous approximation in quotient spaces. Then, we discuss the relationshipin t-proximinality and t-Chebyshevity of a given space and its quotientspace.

متن کامل

Nonlinear weighted best simultaneous approximation in Banach spaces ✩

The present paper is concerned with the problem of weighted best simultaneous approximations in Banach spaces. The weighted best simultaneous approximations to sequences from Sand BS-suns in the Banach space are characterized in view of the Kolmogorov conditions. Applications are provided for weighted best simultaneous approximations from RS-sets and strict RS-sets. Our results obtained in the ...

متن کامل

best simultaneous approximation in fuzzy normed spaces

the main purpose of this paper is to consider the t-best simultaneousapproximation in fuzzy normed spaces. we develop the theory of t-bestsimultaneous approximation in quotient spaces. then, we discuss the relationshipin t-proximinality and t-chebyshevity of a given space and its quotientspace.

متن کامل

Simultaneous greedy approximation in Banach spaces

We study nonlinear m-term approximation with regard to a redundant dictionary D in a Banach space. It is known that in the case of Hilbert space H the pure greedy algorithm (or, more generally, the weak greedy algorithm) provides for each f ∈ H and any dictionaryD an expansion into a series f = ∞ ∑ j=1 cj (f ) j (f ), j (f ) ∈ D, j = 1, 2, . . . with the Parseval property: ‖f ‖2 = ∑j |cj (f )|2...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Acta Mathematica Sinica, English Series

سال: 2008

ISSN: 1439-8516,1439-7617

DOI: 10.1007/s10114-007-6575-0